Improving Topology-Aware Routing Efficiency in Chord
نویسندگان
چکیده
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. From experimental results TaChord shows the drastic improvement in routing performance. Finally, we show that the impact of cache management strategies in the TaChord overlay can’t be neglected.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملGeo-Chord: Geographical Location based Chord Protocol in Grid Computing
Grid computing is a service for sharing computer resources and data storage capacity over the internet. As resource requirements of recent applications increased greatly, grid systems have gained importance in the last decade. Resource discovery is the essential job in Grid computing which provides searching and identifying necessary resources for given processes. There are various Resource Dis...
متن کاملUnderstanding Chord Performance and Topology - aware Overlay Construction for Chord
We studied performance of the Chord scalable lookup system with several performance enhancements. For the denser finger technique, we gave analytical result that shows the average lookup path length decreases slower than the maximum length and converges to it as finger density grows higher. Location cache, as implemented in MIT Chord, is shown to be able to reduce the lookup path length by 1/2 ...
متن کاملApocrypha: Making P2P Overlays Network-aware
Many distributed systems built on peer-to-peer principles organize nodes in an overlay network, in order to enable communication between nodes. In general, this overlay network may have nothing to do with the location of nodes on the physical network. We propose a generic mechanism called Apocrypha to make any P2P overlay “network-aware”, and thus optimize internode communication. We show how A...
متن کاملMulticast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کامل